A decidable characterization of locally testable tree languages
نویسندگان
چکیده
منابع مشابه
A Decidable Characterization of Locally Testable Tree Languages
A regular tree language L is locally testable if membership of a tree in L depends only on the presence or absence of some fix set of neighborhoods in the tree. In this paper we show that it is decidable whether a regular tree language is locally testable. The decidability is shown for ranked trees and for unranked unordered trees.
متن کاملA Characterization for Decidable Separability by Piecewise Testable Languages
The separability problem for word languages of a class C by languages of a class S asks, for two given languages I and E from C, whether there exists a language S from S that includes I and excludes E, that is, I ⊆ S and S ∩E = ∅. In this work, we assume some mild closure properties for C and study for which such classes separability by a piecewise testable language (PTL) is decidable. We chara...
متن کاملA probabilistic extension of locally testable tree languages
Probabilistic k-testable models (usually known as k-gram models in the case of strings) can be easily identified from samples and allow for smoothing techniques to deal with unseen events. In this paper we introduce the family of stochastic k-testable tree languages and describe how these models can approximate any stochastic rational tree language. This is applied, as a particular case, to the...
متن کاملOn Separation by Locally Testable and Locally Threshold Testable Languages
A separator for two languages is a third language containing the first one and disjoint from the second one. We investigate the following decision problem: given two regular input languages, decide whether there exists a locally testable (resp. a locally threshold testable) separator. In both cases, we design a decision procedure based on the occurrence of special patterns in automata accepting...
متن کاملSeparating Regular Languages by Locally Testable and Locally Threshold Testable Languages
A separator for two languages is a third language containing the first one and disjoint from the second one. We investigate the following decision problem: given two regular input languages, decide whether there exists a locally testable (resp. a locally threshold testable) separator. In both cases, we design a decision procedure based on the occurrence of special patterns in automata accepting...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2011
ISSN: 1860-5974
DOI: 10.2168/lmcs-7(4:3)2011